Computing Connectedness: an exercise in computational topology
نویسنده
چکیده
We reformulate the notion of connectedness for compact metric spaces in a manner that may be implemented computationally. In particular, our techniques can distinguish between sets that are connected; have a nite number of connected components; have in nitely many connected components; or are totally disconnected. We hope that this approach will prove useful for studying structures in the phase space of dynamical systems. AMS classi cation scheme numbers: 54D05, 58F13, 68U05. Published in: Nonlinearity 11:913{922, 1998.
منابع مشابه
Computational Topology for Shape Modeling
This paper expands the role of the new field of computational topology by surveying methods for incorporating connectedness in shape modeling. Two geometric representations in particular, recurrent models and implicit surfaces, can (often unpredictably) become connected or disconnected based on typical changes in modeling parameters. Two methodologies for controlling connectedness are identifie...
متن کاملUniform connectedness and uniform local connectedness for lattice-valued uniform convergence spaces
We apply Preuss' concept of $mbbe$-connectedness to the categories of lattice-valued uniform convergence spaces and of lattice-valued uniform spaces. A space is uniformly $mbbe$-connected if the only uniformly continuous mappings from the space to a space in the class $mbbe$ are the constant mappings. We develop the basic theory for $mbbe$-connected sets, including the product theorem. Furtherm...
متن کاملAlgorithms and Data Structures for Computer Topology
The paper presents an introduction to computer topology with applications to image processing and computer graphics. Basic topological notions such as connectivity, frontier, manifolds, surfaces, combinatorial homeomorphism etc. are recalled and adapted for locally finite topological spaces. The paper describes data structures for explicitly representing classical topological spaces in computer...
متن کاملTopology, connectedness, and modal logic
This paper presents a survey of topological spatial logics, taking as its point of departure the interpretation of the modal logic S4 due to McKinsey and Tarski. We consider the effect of extending this logic with the means to represent topological connectedness, focusing principally on the issue of computational complexity. In particular, we draw attention to the special problems which arise w...
متن کاملAn Autonomic Service Oriented Architecture in Computational Engineering Framework
Service Oriented Architecture (SOA) technology enables composition of large and complex computational units out of the available atomic services. Implementation of SOA brings about challenges which include service discovery, service interaction, service composition, robustness, quality of service, security, etc. These challenges are mainly due to the dynamic nature of SOA. SOAmay often need to ...
متن کامل